Easy2Siksha.com
2024
/
( , ++ )
: 3 :75
: ,
-
1. :
()
(b) - -
2. ?
15
-
3. ? ?
Easy2Siksha.com
4. ( )
?
-
5.
6. :
-
7.
8. ? 15
Easy2Siksha.com
2024
/
( , ++ )
: 3 :75
: ,
-
1. :
()
(b) - -
:
, ,
,
-- ,
:
? ,
?
:
?
Easy2Siksha.com
:
? ?
: " ?"
: " ?"
,
,
:
10
10,00,000
,
, :
O(1) ( !)
O(log n) ( )
O(n) ()
O(n²) ( )
O(2ⁿ) !
:
=
=
: :
,
, - -
Easy2Siksha.com
:
, , ,
:
?
:
, (
)
,
, ,
: -
?
,
-
?
:
-
- ,
,
!
Easy2Siksha.com
1:
( )
( )
, ,
!
2:
- ? ,
,
3:
?
?
:
Easy2Siksha.com
,
, :
✔
✔
✔
:
:
()
( )
-
:
,
,
,
- ,
,
,
Easy2Siksha.com
2. ?
:
,
, ,
( )
,
: -
,
:
1. : ( , )
2. ( ) :
- :
c
struct Node {
int data; //
struct Node* next; //
};
NULL ,
( ),
,
Easy2Siksha.com
:
- :
: ,
,
:
1.
2.
3.
4. (C/C++ )
:
c
( ** , ) {
//
(* == NULL) ;
struct Node* temp = *head;
//
( == 0) {
* = ->; //
free(temp); //
;
}
//
for (int i = 0; temp != NULL && i < position - 1; i++) {
= ->;
}
//
(temp == NULL || temp->next == NULL) ;
Easy2Siksha.com
// temp->next
struct Node* next = temp->next->next;
free(temp->next); //
temp->next = next; //
}
:
→ [10 | ] → [20 | ] → [30 | ] → [40 | ] →
:
10
20
30
40
: 2 ( 30 )
-- :
1. (10)
2. 2 → 20
3. 20 30 ( 40)
4. 30
:
→ [10 | ] → [20 | ] → [40 | ] →
, 30
,
( ) ,
,
Easy2Siksha.com
:
/:
:
: n ;
,
,
30 ,
-
3. ? ?
: ?
, ,
:
LIFO ,
:
,
:
✔
✔
Easy2Siksha.com
✔
✔
, ,
,
TOP
?
:2
,
TOP , :
?
?
?
, :
TOP = -1
, TOP , TOP
= 5
0
1
2
3
Easy2Siksha.com
4
:
TOP = -1
10 :
TOP = 0
20 :
= 1
: → 10 → 20 → 30 →
4
1. ()
PUSH ,
: ( ) , TOP3
PUSH , :
:
Easy2Siksha.com
[]
TOP = -1
5 →
[5]
TOP = 0
10 →
[5, 10]
= 1
20 →
[5, 10, 20]
= 2
20
2. ()
POP ,
: ( )TOP3
, :
:
:
[5, 10, 20]
= 2
→ 20
[5, 10]
= 1
Easy2Siksha.com
→ 10
[5]
TOP = 0
→ 5
[]
TOP = -1
3. /
:
[5, 10, 20]
= 2
:
20
4. isEmpty() isFull()
isEmpty()
TRUE :
TOP == -1
isFull()
TRUE :
== - 1
Easy2Siksha.com
,
:
1.
2.
3.
:
→ → → ()
:
()
LIFO
?
; :
✔
✔
✔ /
✔
✔
✔ ( )
Easy2Siksha.com
✔
✔ , (LIFO)
✔TOP
✔
✔ :
→
→
→
isEmpty / isFull →
✔
✔
,
,
, ,
4. ( )
?
: ,
, FIFO
( , ) ,
,
: ,
,
, ( )
Easy2Siksha.com
: ,
,
,
FIFO
:
o :
o :
,
1.
, ,
,
:
𝑟𝑒𝑎𝑟 = (𝑟𝑒𝑎𝑟 + 1)%𝑠𝑖𝑧𝑒
, :
𝑓𝑟𝑜𝑛𝑡 = (𝑓𝑟𝑜𝑛𝑡 + 1)%𝑠𝑖𝑧𝑒
% ,
2.
,
:
Easy2Siksha.com
1. ()
,
:
𝑟𝑒𝑎𝑟 = (𝑟𝑒𝑎𝑟 + 1)%𝑠𝑖𝑧𝑒
2. ()
,
:
𝑓𝑟𝑜𝑛𝑡 = (𝑓𝑟𝑜𝑛𝑡 + 1)%𝑠𝑖𝑧𝑒
3. ( )
4.
:
(𝑟𝑒𝑎𝑟 + 1)%𝑠𝑖𝑧𝑒 == 𝑓𝑟𝑜𝑛𝑡
5.
:
𝑓𝑟𝑜𝑛𝑡 == −1
5
:
= -1, = -1
= [ , , , , ]
1: 10
Easy2Siksha.com
= 0, = 0
= [10, , , , ]
2: 20
= 0, = 1
= [10, 20, , , ]
3: 30
= 0, = 2
= [10, 20, 30, , ]
4: (10 )
= 1, = 2
= [ , 20, 30, , ]
5: 40, 50, 60
40 50 :
= 1, = 4
= [ , 20, 30, 40, 50 ]
60 : 0
= 1, = 0
= [60, 20, 30, 40, 50]
0 :
, :
,
Easy2Siksha.com
,
, , ,
-
5.
? ,
- ? !
,
, ,
:
-
:
( )
Easy2Siksha.com
--
:
5, 9, 12, 18, 23, 30, 45, 50
23
1:
,
18
18, 23 ?
:
23, 18 18 ?
23 , ,
:
23, 30, 45, 50
2:
30
30, 23 ?
23, 30 ? !
:
23
Easy2Siksha.com
3:
23 ? !
!
:
1.
2.
3. ,
4.
( )
1.
2.
3.
4. → !
5. →
6. →
7.
: , 1,000 ,
1,000
Easy2Siksha.com
:
1000 → 500 → 250 → 125 → 62 → 31 → 15 → 7 → 3 → 1
1000 , 10
, ?
:
O(log₂ n)
- ,
:
1,000 → 10
1,000,000 → 20
:
O(1)
( , O(log
n) )
, :
1.
,
, -
2.
Easy2Siksha.com
:
3.
, ,
(, , )
4.
,
5.
- ( ),
?
" "
Easy2Siksha.com
, -
O(log n) ,
,
, ,
6. :
: ,
, ,
, ,
: , -
?
-
( ) -
:
:
:
" " ,
--
Easy2Siksha.com
1.
2.
3.
4.
5.
:
c
i = 0 n-1 :
= i
j = i+1 n :
arr[j] < arr[min_index]:
=
(arr[i], arr[min_index])
:
[64, 25, 12, 22, 11]
1:
: [64, 25, 12, 22, 11]
11
64 11
: [11, 25, 12, 22, 64]
2:
: [11, 25, 12, 22, 64]
[25, 12, 22, 64] 12
12 25
: [11, 12, 25, 22, 64]
3:
: [11, 12, 25, 22, 64]
[25, 22, 64] 22
22 25
: [11, 12, 22, 25, 64]
Easy2Siksha.com
4:
: [11, 12, 22, 25, 64]
[25, 64] 25
25 ( )
: [11, 12, 22, 25, 64]
5:
(64),
:
[11, 12, 22, 25, 64]
,
,
1. :
o :𝑂(𝑛
2
)
o :𝑂(𝑛
2
)
o :𝑂(𝑛
2
)
2. :
o 𝑂(1)(- , )
3. :
o ( )
4. :
o
Easy2Siksha.com
𝑂(𝑛
2
)
,
[29, 10, 14, 37, 13]
: 10 29 → [10, 29, 14, 37, 13]
2: [29, 14, 37, 13] 13 29 → [10, 13, 14, 37,
29]
3: [14, 37, 29] 14 → [10, 13, 14, 37, 29]
4: [37, 29] 29 37 → [10, 13, 14, 29, 37]
5:
: [10, 13, 14, 29, 37]
-
,
-
7.
: ?
,
- :
- -
,
:
-
Easy2Siksha.com
?
:
→
→
→
... -
- ,
- , :
addTwoNumbers()
addThreeNumbers()
addFloatNumbers()
:
add()
add()
add()
,
- (//)
C++
-
#include <iostream>
std;
{
Easy2Siksha.com
:
//
int add(int a, int b) {
a + b ;
}
//
int add(int a, int b, int c) {
a + b + c ;
}
//
( , ) {
a + b ;
}
};
int main() {
c;
cout << "2 : " << c.add(10, 20) << endl;
cout << "3 : " << c.add(10, 20, 30) << endl;
cout << " : " << c.add(5.5f, 4.5f) << endl;
0 ;
}
?
add()
:
add() → 2
add() → 3
add() → 2
, -
:
:
c.add(10, 20);
Easy2Siksha.com
:
int add(int, int)
:
c.add(10, 20, 30);
:
int add(int, int, int)
:
c.add(5.5f, 4.5f);
:
float add(float, float)
-
-
:
{
:
( ) {
<< " : " << ;
}
( ) {
cout << " : " << ;
}
( , ) {
<< " : " << ;
cout << ": " << ;
}
};
Easy2Siksha.com
, () :
,
:
✔
✔
✔
✔
✔
✔-
:
( , )
:
int test(){
10 ;
}
float test(){
10.5 ;
}
?
Easy2Siksha.com
:
-
( )
-
-
, ,
-
-
, -
8. ?
:
- (OOP) ,
, - ,
, : ,
: ,
?
(OOP) (
) ( )
Easy2Siksha.com
():
():
"" ,
, "" , ""
, (
)
1. :
2. : ,
3. :
4. :
,
,
( )
, ,
()
:
# 1
:
():
(" : ")
Easy2Siksha.com
# 2
:
():
(" : ")
#
(, ):
():
(" : ")
#
c = Child()
c.skill() # ?
c.talent()
:
:
:
- -
() , (MRO)
- ()
:
/ \
\ /
D, B C
D, A ,
B C
- - :
Easy2Siksha.com
C++:
: (MRO)
1. : : :
2. :
3. :
1. :
2. :
3. :
- " " -
,
C++
#include <iostream>
std;
{
:
() {
cout << " : " << ;
}
};
{
:
() {
<< " : " << ;
}
};
: , {
:
() {
Easy2Siksha.com
cout << " : " << endl;
}
};
int main() {
c;
c.::(); //
.::();
.();
0 ;
}
:
:
:
:
C++ , ,
- , :
,
-
- ,
,
